#include <iostream>
#include <string.h>
using namespace std;

const int N = 1010;
int n, V, v[N], w[N];
int dp[N];
int main()
{
    cin >> n >> V;
    for (int i = 1; i <= n; i++)
        cin >> v[i] >> w[i];
    for (int i = 1; i <= n; i++)
        for (int j = v[i]; j <= V; j++)
        {

            dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
        }
    cout << dp[v] << endl;
    memset(dp, 0, sizeof(dp));
    for (int j = 1; j <= V; j++) dp[j] = -1;
    for (int i = 1; i <= n; i++)
        for (int j = v[i]; j <= V; j++)
        {

            if (dp[i][j - v[i]] != -1)
                dp[j] = max(dp[j], dp[j - v[i]] + w[i]);
        }
    cout << (dp[V] != -1 ? 0 : dp[V]) << endl;
    return 0;
}


